#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
const LL mod=1e9+7;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL sum[maxn],cnt[maxn];
LL fac[maxn];
LL ksm(LL a,LL k){LL res=1;while(k>0){ if(k&1) res=res*a%mod;k>>=1; a=a*a%mod;}return res%mod;}
LL ccc(LL n,LL m){
    if(m>n) return 0;
    return (fac[n]%mod*ksm(fac[m],mod-2)%mod*ksm(fac[n-m],mod-2)%mod)%mod;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  fac[0]=1;
  for(LL i=1;i<=2e5;i++) fac[i]=fac[i-1]*i%mod;
  ///cout<<ccc(3,3)<<"\n";
  LL t;cin>>t;
  while(t--){
    LL n,m,k;cin>>n>>m>>k;
    for(LL i=0;i<n+10;i++) sum[i]=cnt[i]=0;
    for(LL i=1;i<=n;i++){
        LL x;cin>>x;cnt[x]++;
    }
    for(LL i=1;i<=n;i++){
        sum[i]=sum[i-1]+cnt[i];
    }
    LL ans=0;
    for(LL i=1;i<=n;i++){
        LL p=cnt[i];
        LL o=sum[i-1]-sum[max(i-k-1,(LL)0)];
        for(LL j=1;j<=min(m,p);j++){
            ans=(ans%mod+ccc(p,j)%mod*ccc(o,m-j)%mod)%mod;
        }

    }
    cout<<ans<<"\n";
  }
return 0;
}
